RV-Xplorer: A Way to Navigate Lattice-Based Views over RDF Graphs
نویسندگان
چکیده
More and more data are being published in the form of machine readable RDF graphs over Linked Open Data (LOD) Cloud accessible through SPARQL queries. This study provides interactive navigation of RDF graphs obtained by SPARQL queries using Formal Concept Analysis. With the help of this View By clause a concept lattice is created as an answer to the SPARQL query which can then be visualized and navigated using RV-Xplorer (Rdf View eXplorer). Accordingly, this paper discusses the support provided to the expert for answering certain questions through the navigation strategies provided by RV-Xplorer. Moreover, the paper also provides a comparison of existing state of the
منابع مشابه
Lattice-Based View Access: A way to Create Views over SPARQL Query for Knowledge Discovery
The data published in the form of RDF resources is increasing day by day. This mode of data sharing facilitates the exchange of information across the domains. Although it provides easier ways in the use of data such as through SPARQL queries. These queries over semantic web data usually produce list of tuples as answers which may be huge in number or may require further manipulation so that it...
متن کاملStar-like auto-configurable layouts of variable radius for visualizing and exploring RDF/S ontologies
The visualization of ontologies is a challenging task especially if they are large. In this paper we propose a visualization approach which is based on star-like graphs of variable radius which enables users to gradually explore and navigate through the entire ontology without overloading them. The star-like graphs are visualized using a Force Directed Placement algorithm (FDP) special suited f...
متن کاملNode-centric RDF Graph Visualization
RDF, visualization, Resource Description Framework, graph, browser, nodecentric This paper describes a node-centric technique for visualizing Resource Description Framework (RDF) graphs. Nodes of interest are discovered by searching over literals. Subgraphs for display are constructed by using the area around selected nodes. Wider views are created by sorting and displaying nodes based on the n...
متن کاملRoman domination excellent graphs: trees
A Roman dominating function (RDF) on a graph $G = (V, E)$ is a labeling $f : V rightarrow {0, 1, 2}$ suchthat every vertex with label $0$ has a neighbor with label $2$. The weight of $f$ is the value $f(V) = Sigma_{vin V} f(v)$The Roman domination number, $gamma_R(G)$, of $G$ is theminimum weight of an RDF on $G$.An RDF of minimum weight is called a $gamma_R$-function.A graph G is said to be $g...
متن کاملKeyword-Based Navigation and Search over the Linked Data Web
Keyword search approaches over RDF graphs have proven intuitive for users. However, these approaches rely on local copies of RDF graphs. In this paper, we present an algorithm that uses RDF keyword search methodologies to find information in the live Linked Data web rather than against local indexes. Users navigate between documents by specifying keywords that are matched against triples. Navig...
متن کامل